Optimised onstru tions for variable - length error
نویسنده
چکیده
منابع مشابه
Aeùñö¹ìììóööøø Óò×øöù Blockinøøóò× Óó Ae Blockin Blockin Blockinòø È××ùùó¹êêòòóñ Ùò Blockinøøóò×
We des ribe eÆ ient onstru tions for various ryptographi primitives in private-key as well as publi -key ryptography. Our major results are two new onstru tions of pseudorandom fun tions. We prove the pseudo-randomness of one onstru tion under the assumption that fa toring (Blum integers) is hard while the other onstru tion is pseudo-random if the de isional version of the DiÆe-Hellman assumpti...
متن کاملAe Blockin Blockin Blockinòø Øøöö××óðð ×××òòøùöö¸ñùðøø×××òòøùöö Òò Ððòò ×××òòøùöö × Blockinññ× ××× Óò Øøø Ô¹¹¹aeae¹ààððññò¹¹öóùô ×××òòøùöö × Blockinññ
signature s hemes based on the Gap-DiÆe-Hellman-group signature s heme Alexandra Boldyreva August 12, 2002 Abstra t We propose a robust proa tive threshold signature s heme, a multisignature s heme and a blind signature s heme whi h work in any Gap DiÆe-Hellman (GDH) group (where the Computational DiÆe-Hellman problem is hard but the De isional DiÆe-Hellman problem is easy). Our onstru tions ar...
متن کامل̹¹¹ºº½½ Ëô Blockin Blockin
Relations between OWFs, PRGs and PRFs (revised) Jan-Erik Ekberg February 19, 2002 1 Introdu tion These le ture notes intend to give an overview of the provable relations between one-way fun tions (OWFs), pseudorandom generators (PRGs) and pseudorandom fun tions (PRFs). Only a sele ted number of proofs and redu tions are thoroughly presented in this paper (most are left to the referen es), but t...
متن کاملË Blockinóò Èööñ Øøø Blockin× Óò Øööö Àà×× Ùò Blockinøøóò× Ðò Òöööú
Abstra t. We develop a new generi long-message se ond preimage atta k, based on ombining the te hniques in the se ond preimage atta ks of Dean [8℄ and Kelsey and S hneier [16℄ with the herding atta k of Kelsey and Kohno [15℄. We show that these generi atta ks apply to hash fun tions using the Merkle-Damgård onstru tion with only slightly more work than the previously known atta k, but allow eno...
متن کاملSemantics of the reFLe t Language
reFLe t is a new fun tional language, developed at Intel for use in hardware design and veri ation. It ontains features intended to fa ilitate the onstru tion, analysis, and manipulation of the language's own programs. It is also intended to be the exe utable subset of the term language of a theorem prover based on higher order logi . In this paper, we onsider ore reFLe t|a language that extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003